The Common Fragment of CTL and LTL
نویسنده
چکیده
It is well-known that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete. By omitting path quantifiers, we get an inductive definition of the LTL formulas expressible in ACTL. We can show that the fragment defined by our logic represents exactly those LTL formulas the negation of which can be represented by a 1-weak Büchi automaton and that for this fragment, the representing automaton can be chosen to be of size linear in the size of the formula.
منابع مشابه
The Common Fragment of ACTL and LTL
The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where only universal path quantification is allowed. The common fragment of LTL and ACTL is shown to be strictly smaller than the common fragment of LTL and CTL. Furthermore, an algorithm is presented for deciding if an LTL formula can be expressed in ACTL. This algorithm uses an effe...
متن کاملPartial Order Reductions
Streszczenie Problem eksplozji stann ow mo_ ze zosta c ograniczony poprzez u_ zycie redukcji cz , e sciowo-porz , adkowych. Metody te polegaj , a na budowaniu tylko frag-mentu pee lnej przestrzeni stann ow programu, ktt ory jest wystarczaj , acy do wery-kacji formuu l logik temporalnych LTL ?X lub CTL ?X (tzn. LTL lub CTL* bez operatora nast , epnego kroku). Jest to zagwarantowane poprzez za-ch...
متن کاملImproving Partial Order Reductions for Universal Branching Time Properties
The "state explosion problem" can be alleviated by using partial order reduction techniques. These methods rely on expanding only a fragment of the full state space of a program, which is suucient for verifying the formulas of temporal logics LTL ?X or CTL ?X (i.e., LTL or CTL* without the next state operator). This is guaranteed by preserving either a stuttering maximal trace equivalence or a ...
متن کاملParallel Model Checking for LTL, CTL*, and Lµ2
We describe a parallel model-checking algorithm for the fragment of the μ-calculus that allows one alternation of minimal and maximal fixed-point operators. This fragment is also known as Lμ. Since LTL and CTL ∗ can be encoded in this fragment, we obtain parallel model checking algorithms for practically important temporal logics. Our solution is based on a characterization of this problem in t...
متن کاملTemporal Logics for Hyperproperties
Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL∗ can refer only to a single path at a time, hence cannot express many hyperproperties of interest. The logics proposed here, HyperLTL and HyperCTL∗, add explicit an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000